SIMD-Matcher: A SIMD-based Arbitrary Matching Framework
نویسندگان
چکیده
Packet classification methods rely upon matching packet content/header against pre-defined rules, which are generated by network applications and their configurations. With the rapid development of technology fast-growing applications, users seek more enhanced, secure, diverse services. Hence it becomes critical to improve performance arbitrary operations. This article presents SIMD-Matcher, an efficient Single Instruction Multiple Data (SIMD) cache-friendly framework. To further performance, SIMD-Matcher adopts a trie node with fixed high fanout varying span for each depending on data distribution. The layout leverages cache modern processor features such as SIMD instructions. support matching, we first interpret rules into three fields: value, mask, priority. Second, insertion randomly positioned wildcards propose extraction algorithm process wildcard bits. Third, add array entries leaf entries, store guarantee correctness results. Experiments show that outperforms GenMatcher under large-scale ruleset key set, in terms search time, insert memory cost. Specifically 5M our method achieves 2.7X speedup time takes \( ~\sim \!\! 7.3 \) seconds, gaining 1.38X speedup; meanwhile, cost reduction is up 6.17X.
منابع مشابه
Arbitrary Precision Arithmetic - SIMD Style
Current day general purpose processors have been enhanced with what is called " media instruction set " t o achieve performance gains in applications that are media processing intensive. The instruction set that have been added exploit the fact that media applications have small native datatypes and have widths much less than that supported by commercial processors and the plethora of data-para...
متن کاملJumbled Matching with SIMD
Jumbled pattern matching addresses the problem of finding all permuted occurrences of a substring in a text. We introduce two improved algorithms for exact jumbled matching of short patterns. Our solutions apply SIMD (Single Instruction Multiple Data) computation in order to quickly filter the text. One of them utilizes the equal any operation and the other searches for the least frequent chara...
متن کاملFPGA-based SIMD Processor
A massively parallel single instruction multiple data stream (SIMD) processor designed specifically for cryptographic key search applications is presented. This design aims to exploit fine grain parallelism and the high memory bandwidth available in an FPGA by integrating 95 simple processors and memory on a single FPGA chip. Performance is compared with a previously reported hardwired design o...
متن کاملA parallel algorithm for incremental stereo matching on SIMD machines
Previous matching algorithms have achieved high speeds through algorithm simplification and/or relied on custom hardware. The objective of our work has been the development a robust high-speed stereo matcher by exploiting parallel algorithms executing on general purpose SIMD machines. Our approach is based on several existing techniques dealing with the classification and evaluation of matches,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2022
ISSN: ['1544-3973', '1544-3566']
DOI: https://doi.org/10.1145/3514246